Transforming graph states to Bell-pairs is NP-Complete
نویسندگان
چکیده
منابع مشابه
Graph 2-Isomorphism is NP-Complete
Two graphs G and G' are said to be k-isomorphic if their edge sets can be partitioned into E(G) = ElUE2 u . . . uEk and E(G' > = E-j-U E; IJ l . . IJEk such that as graphs, E i and E! are 1 isomorphic for l<i<k. In this note we show that it is NP-complete to decide whether two graphs are 2-isomorphic. This research was supported in part by National Science Foundation grant MCS77-05313. -I * Giv...
متن کاملThe Graph Genus Problem is NP-Complete
The genus g(G) of a graph G is the smallest number g such that G can be embedded on the orientable surface of genus g. Given a graph G and a natural number k one may ask: Is g(G) I k? This problem, called the graph genus problem, is one of the remaining basic open problems, listed by Garey and Johnson 121, for which there is neither a polynomially bounded algorithm nor a proof that the problem ...
متن کاملCollapsing cliques to get a planar graph is NP-complete
A graph is a (planar, Kh)-graph if a collection of disjoint clusters can be identified such that the subgraph induced by each cluster is an h-clique and collapsing all clusters yields a planar graph. Recognizing (planar, Kh)-graphs is a special instance of the more general problem of recognizing (X ,Y)-graphs, where X and Y are two chosen families of graphs. This model, together with the (X ,Y)...
متن کاملBell inequalities for graph states.
We investigate the nonlocal properties of graph states. To this aim, we derive a family of Bell inequalities which require three measurement settings for each party and are maximally violated by graph states. In turn, for each graph state there is an inequality maximally violated only by that state. We show that for certain types of graph states the violation of these inequalities increases exp...
متن کاملMining for trees in a graph is NP-complete
Of course, the even more general problem where the pattern is a graph is already well-known to be NP-complete, as it contains the well-known NP-complete Subgraph Isomorphism problem as the special case k = 1. We thus see here that restricting to tree patterns does not lower the worst-case complexity. The NP-completeness of Disjoint Occurrences of T3 follows immediately from the NP-completeness ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum
سال: 2020
ISSN: 2521-327X
DOI: 10.22331/q-2020-10-22-348